Subexponential Parameterized Algorithms Collapse the W - hierarchy ∗ ( Extended
نویسندگان
چکیده
It is shown that for essentially all MAX SNP-hard optimization problems finding exact solutions in subexponential time is not possible unless W [1] = FPT . In particular, we show that O(2p(n)) parameterized algorithms do not exist for Vertex Cover, Max Cut, Max c-Sat, and a number of problems on bounded degree graphs such as Dominating Set and Independent Set, unless W [1] = FPT . Our results are derived via an approach that uses an extended parameterization of optimization problems and associated techniques to relate the parameterized complexity of problems in FPT to the parameterized complexity of extended versions that are W [1]-hard. Track: A
منابع مشابه
Polynomial kernels collapse the W-hierarchy
We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the Whierarchy (i.e., W[P] = FPT). The collapsing results are also extended to assumed exponential kernels for problems in the class FPT. In particular, we establish a close relationship between polynomial (and exponential) kernelizability and the existence of sub-exponen...
متن کاملOn the Structure of Parameterized Problems in NP (Extended Abstract)
Fixed-parameter intractability of optimization problems in NP is studied based on computational models with limited nondeterminism. Strong evidence is provided that many NP optimization problems are not fixed-parameter tractable and that the fixed-parameter intractability hierarchy (the W -hierarchy) does not collapse.
متن کاملBidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has been sucessfully applied to yield subexponential time parameterized algorithms, EPTASs and linear kernels for many problems on families of graphs excluding a fixed graph H as a minor. In this paper we use several of th...
متن کاملThe Exponential Time Hypothesis and the Parameterized Clique Problem
In parameterized complexity there are three natural definitions of fixed-parameter tractability called strongly uniform, weakly uniform and nonuniform fpt. Similarly, there are three notions of subexponential time, yielding three flavours of the exponential time hierarchy (ETH) stating that 3Sat is not solvable in subexponential time. It is known that ETH implies that p-Clique is not fixed-para...
متن کاملSubexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) the maximum number of edges (or vertices) using a given number (k) of vertices, rather than covering all edges (or vertices). In general graphs, these problems are hard for parameterized complexity classes when paramet...
متن کامل